Average Drift Analysis and Population Scalability
نویسندگان
چکیده
منابع مشابه
Drift analysis and average time complexity of evolutionary algorithms
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some new results on the average time complexity of EAs. Based on drift analysis, some useful drift conditions for deriving the time complexity of EAs are studied, including conditions under which an EA will take no more than polynomial time (in problem size) to solve a prob...
متن کاملNovel Analysis of Population Scalability in Evolutionary Algorithms
Population-based evolutionary algorithms (EAs) have been widely applied to solve various optimization problems. The question of how the performance of a population-based EA depends on the population size arises naturally. The performance of an EA may be evaluated by different measures, such as the average convergence rate to the optimal set per generation or the expected number of generations t...
متن کاملAdded Resistance & Drift Force Analysis in Regular and Irregular Waves
The sea wave causes excess resistance which is out of scope of calm water resistance. The total wave force in horizontal plane is divided into “Added Resistance” and “Drift Force”. In this study, based on Gerritsma and Beuckelman[3] hypothesis a computer program has been developed for calculation of added resistance and drift force at various ship speeds and various head...
متن کاملAnalysis of a Benthic - Drift Model for a Stream Population
One key issue for theory in stream ecology is how much stream flow can be changed while still maintaining an intact stream ecology, instream flow needs (IFNs); the study of determining IFNs is challenging due to the complex and dynamic nature of the interaction between the stream environment and the biological community. We develop a process-oriented benthic-drift model that links changes in th...
متن کاملAverage-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By modeling parallel algorithms on multiprocessors using task precedence graphs, we are mainly interested in the effects of synchronization overhead and load imbalance on the performance of parallel computations. Thus, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2016
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2016.2608420